Differential Probability of Modular Addition with a Constant Operand
نویسنده
چکیده
In this article I analyze the function f(X) = A + X (mod 2 ) exclusive-or differential probability. 1 The result, regarding differential cryptanalysis, is a better understanding of ciphers that use f(X) as a primitive operation. A simple O(α ) algorithm to compute the probability is given.
منابع مشابه
Efficient Pre-Processing for Large Window-Based Modular Exponentiation Using Ant Colony
Modular exponentiation is the main operation to RSA-based public-key cryptosystems. It is performed using successive modular multiplications. This operation is time consuming for large operands, which is always the case in cryptography. For software or hardware fast cryptosystems, one needs thus reducing the total number of modular multiplications required. Existing methods attempt to reduce th...
متن کاملSome functional inequalities in variable exponent spaces with a more generalization of uniform continuity condition
Some functional inequalities in variable exponent Lebesgue spaces are presented. The bi-weighted modular inequality with variable exponent $p(.)$ for the Hardy operator restricted to non- increasing function which is$$int_0^infty (frac{1}{x}int_0^x f(t)dt)^{p(x)}v(x)dxleqCint_0^infty f(x)^{p(x)}u(x)dx,$$ is studied. We show that the exponent $p(.)$ for which these modular ine...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملFaster Modular Multiplication by Operand Scaling
There are a number of techniques known for speeding up modular multiplication, which is the main arithmetic operation in RSA cryptography. This note shows how to gain speed by scaling the modulus. Resulting hardware is limited only by the speed of addition. Detailed analysis of fan out shows that over existing methods the speedup is potentially as much as two-fold. This is because the addition ...
متن کاملVLSI Implementation Of High Performance Montgomery Modular Multiplication For Crypto graphical Application
-The multiplier receives and outputs the data with binary representation and uses only one-level Carry Save Adder (CSA) to avoid the carry propagation at each addition operation. This CSA is also used to perform operand pre computation and format conversion from the carry save format to the binary representation, leading to a low hardware cost and short critical path delay at the expense of ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2001 شماره
صفحات -
تاریخ انتشار 2001